[livres divers classés par sujet] [Informatique] [Algorithmique] [Programmation] [Mathématiques] [Hardware] [Robotique] [Langage] [Intelligence artificielle] [Réseaux]
[Bases de données] [Télécommunications] [Chimie] [Médecine] [Astronomie] [Astrophysique] [Films scientifiques] [Histoire] [Géographie] [Littérature]

Evaluating Robustness of Coupled Selection Equations Using Sparse Communication

contributor IPVS, Bildverstehen
creator Lafrenz, Reinhard
Schanz, Michael
Kaeppeler, Uwe-Philipp
Zweigle, Oliver
Rajaie, Hamid
Schreiber, Frank
Levi, Paul
date 2008-07
description In this paper we evaluate the robustness of a self-organized mechanism to distribute roles among a team of cooperating robots. In previous work, we showed the principal applicability of this approach for the RoboCup scenario. Now we test the robustness in case of either intentionally sparse communication or the behavior in situations, where the communication is massively disturbed. To overcome the problems caused by this, each robot runs the equations individually, synchronizing from time to time, or when the communication is available.
identifier  http://www.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=INPROC-2008-104&engl=1
language eng
publisher IOS Press
source In: Burgard et al. (ed.): Intelligent Autonomous Systems 10 (IAS-10), pp. 272-277
subject Robotics (CR I.2.9)
Distributed Artificial Intelligence (CR I.2.11)
Numerical Analysis Applications (CR G.1.10)
title Evaluating Robustness of Coupled Selection Equations Using Sparse Communication
type Text
Article in Proceedings